On the Expressiveness of Temporal Logic Programming
نویسندگان
چکیده
منابع مشابه
On the Expressiveness and Monitoring of Metric Temporal Logic
It is known that Metric Temporal Logic (MTL) is strictly less expressive than the Monadic First-Order Logic of Order and Metric (FO[<, +1]) when interpreted over timed words; this remains true even when the time domain is bounded a priori. In this work, we present an extension of MTL with the same expressive power as FO[<, +1] over bounded timed words (and also, trivially, over time-bounded sig...
متن کاملTemporal Logic + Timed Automata : Expressiveness and
We investigate the veriication problem of timed automata w.r.t. linear-time dense time temporal logics. We propose a real-time logic TATL which extends the propositional temporal logic with constraints involving timed automata. These constraints allow to require that the computation segment since some designated point is accepted by a given timed automaton. We identify an expressively powerful ...
متن کاملLinear Temporal Logic: Expressiveness and Model Checking
Model checking of finite-state systems with specifications given as formulae of Linear Temporal Logic (LTL) is one of the most common verification problems. Like other verification problems, LTL model checking suffers from state explosion. Techniques tackling state explosion usually employ some specific property of the LTL fragment they are designed for. For example, a popular method called par...
متن کاملSeparation logic : expressiveness, complexity, temporal extension
This thesis studies logics which express properties about programs. These logics were originally intended for the formal verification of programs with pointers. Overall, no automated verification method will be proved tractable here; rather, we give a new insight on separation logic. The complexity and decidability of some essential fragments of this logic for Hoare triples were not known befor...
متن کاملThe Relative Expressiveness of Abstract Argumentation and Logic Programming
We analyze the relative expressiveness of the two-valued semantics of abstract argumentation frameworks, normal logic programs and abstract dialectical frameworks. By expressiveness we mean the ability to encode a desired set of two-valued interpretations over a given propositional vocabulary A using only atoms from A. While the computational complexity of the two-valued model existence problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1995
ISSN: 0890-5401
DOI: 10.1006/inco.1995.1036